A Remark on Computing Distance Functions

نویسندگان

  • Giovanni Russo
  • Peter Smereka
چکیده

We propose a new method for the reconstruction of the signed distance function in the context of level set methods. The new method is a modification of the algorithm which makes use of the PDE equation for the distance function introduced by M. Sussman, P. Smereka, and S. Osher (1994, J. Comput. Phys. 119, 146). It is based mainly on the use of a truly upwind discretization near the interface. Comparison with the previous algorithm shows a definite improvement. When used with a first-order upwind scheme, the method provides first-order accuracy for the signed distance function in the whole computational domain, and second-order accuracy in the location of the interface. A second-order version of the method is also presented. c © 2000 Academic Press

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A remark on boundedness of composition operators between weighted spaces of holomorphic functions on the upper half-plane

In this paper, we obtain a sucient condition for boundedness of composition operators betweenweighted spaces of holomorphic functions on the upper half-plane whenever our weights are standardanalytic weights, but they don't necessarily satisfy any growth condition.

متن کامل

A remark on the means of the number of divisors

‎We obtain the asymptotic expansion of the sequence with general term $frac{A_n}{G_n}$‎, ‎where $A_n$ and $G_n$ are the arithmetic and geometric means of the numbers $d(1),d(2),dots,d(n)$‎, ‎with $d(n)$ denoting the number of positive divisors of $n$‎. ‎Also‎, ‎we obtain some explicit bounds concerning $G_n$ and $frac{A_n}{G_n}$.

متن کامل

A Novel Trust Computation Method Based on User Ratings to Improve the Recommendation

Today, the trust has turned into one of the most beneficial solutions to improve recommender systems, especially in the collaborative filtering method. However, trust statements suffer from a number of shortcomings, including the trust statements sparsity, users' inability to express explicit trust for other users in most of the existing applications, etc. Thus to overcome these problems, this ...

متن کامل

A survey on impact of cloud computing security challenges on NFV infrastructure and risks mitigation solutions

Increased broadband data rate for end users and the cost of resource provisioning to an agreed SLA in telecom service providers, are forcing operators in order to adhere to employment Virtual Network Functions (VNF) in an NFV solution. The newly 5G mobile telecom technology is also based on NFV and Software Define Network (SDN) which inherit opportunities and threats of such constructs. Thus a ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000